Remarks on permutive cellular automata

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remarks on permutive cellular automata

We prove that every n-dimensional permutive cellular automaton is conjugate to a one-sided shift with compact set of states. This is a generalization of a theorem of R. Gilman.

متن کامل

Partially Permutive Cellular Automata

One dimensional cellular automata are analyzed via their generalized permutivity. Invariant subalphabets provide a systematic way of identifying periodic and aperiodic tilings as well as stationary distributions invariant under the cellular automaton iteration. In the case of several invariant subalphabets a hierarchy of interaction phenomena arise. In particular the interaction of subalphabets...

متن کامل

The Complexity of Permutive Cellular Automata

This paper studies cellular automata in two aspects: Ergodic and topological behavior. For ergodic aspect, the formulae of measure-theoretic entropy, topological entropy and topological pressure are given in closed forms and Parry measure is demonstrated to be an equilibrium measure for some potential function. For topological aspect, an example is examined to show that the exhibition of snap-b...

متن کامل

Identification of Cellular Automata: theoretical remarks

Modeling nonlinear system has come on the fore in the last decades; some results are now available, even if precision and simplicity of application characteristics of linear problems do not hold anymore. One of the most important issues to face in structuring a nonlinear model is the identification of the rules that govern its evolution. This paper collects some of the results achieved for solv...

متن کامل

0 Some remarks on A ( 1 ) 1 soliton cellular automata

We describe the A (1) 1 soliton cellular automata as an evolution of a poset. This allows us to explain the conservation laws for the A (1) 1 soliton cellular automata, one given by Torii, Takahashi and Satsuma, and the other given by Fukuda, Okado and Yamada, in terms of the stack permutations of states in a very natural manner. As a biproduct, we can prove a conjectured formula relating these...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2003

ISSN: 0022-0000

DOI: 10.1016/s0022-0000(03)00049-7